Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
نویسندگان
چکیده
منابع مشابه
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
In this paper we present several \infeasible-start" path-following and potential-reduction primal-dual interior-point methods for nonlinear conic problems. These methods try to nd a recession direction of the feasible set of a self-dual homogeneous primal-dual problem. The methods under consideration generate an-solution for an-perturbation of an initial strictly (primal and dual) feasible prob...
متن کاملInfeasible - Start Primal - Dual Methodsand
In this paper we present several \infeasible-start" path-following and potential-reduction primal-dual interior-point methods for nonlinear conic problems. These methods try to nd a recession direction of the feasible set of a self-dual homogeneous primal-dual problem. The methods under consideration generate an-solution for an-perturbation of an initial strictly (primal and dual) feasible prob...
متن کاملGlobal Convergence of Primal-Dual Methods for Nonlinear Programming
We propose a new globalization strategy for primal-dual interior-point methods in nonlinear programming that relaxes the requirement of closely following the central path and lends itself to dynamic updates of the barrier parameter. The latter promote better synchonization between the barrier parameter and the optimality residual, and increase robustness. Global convergence is proved under mild...
متن کاملPrimal-Dual Interior Methods for Nonconvex Nonlinear Programming
Recently, infeasibility issues in interior methods for nonconvex nonlinear programming have been studied. In particular, it has been shown how many line-search interior methods may converge to an infeasible point which is on the boundary of the feasible region with respect to the inequality constraints. The convergence is such that the search direction does not tend to zero, but the step length...
متن کاملPrimal–dual Methods for Nonlinear Constrained Optimization
. . . If a function of several variables should be a maximum or minimum and there are between these variables one or several equations, then it will be suffice to add to the proposed function the functions that should be zero, each multiplied by an undetermined quantity, and then to look for the maximum and the minimum as if the variables were independent; the equation that one will find combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1999
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107980009a